Phrase Based Document Retrieving by Combining Suffix Tree index data structure and Boyer- Moore faster string searching algorithm

Phrase has been considered as a more informative feature term for improving the effectiveness of document retrieval .This paper propose an Algorithm A Phrase Based Document Retrieval to retrieve the similar documents by combining two exiting algorithm suffix tree ,index data structure and “The Boyer-Moore Algorithm”, faster string searching algorithm. The suffix tree is constructed based on E. Ukkonen, “on-Line Construction Of Suffix Trees For Strings, a most efficient string-matching algorithm. On the constructed suffix ,”The Boyer-Moore Algorithm” is applied to check the presence of pattern i.e. the input phrase in order and without order to retrieve the similar documents. Furthermore, by studying the property of suffix tree and Boyer-Moore, we conclude that suffix tree data structure store huge documents and Boyer-Moore algorithm checks the presence of pattern fastly. This conclusion sufficiently explains why the Phrase Based Document Retrieval works much better than the other document retrieval.